A Coverage Area Maximizing Algorithm for Deadline Situations
نویسنده
چکیده
Although many smart coverage algorithms for intelligent robots have been proposed, to the best of our knowledge, all of them make the same assumption that they have sufficient time to cover the entire target area. However, the time to completely cover the whole target area may not always be available. Therefore, in this paper, we propose another new coverage scheme, which we call the DmaxCoverage algorithm that decides the coverage path by considering the deadline for coverage. This approach can be beneficial when the time for the coverage is not sufficient to cover the entire target area. Experimental results show that the DmaxCoverage algorithm outperforms previous algorithms for these situations.
منابع مشابه
An Efficient Area Maximizing Coverage Algorithm for Intelligent Robots with Deadline Situations
Coverage algorithm is one of the core technologies required for intelligent robots such as cleaning robots, harvesting robots, painting robots and lawn mowing robots. Although many smart coverage algorithms have been proposed, to the best of our knowledge, all of them make the same assumption that they have sufficient time to cover the entire target area. However, the time to completely cover t...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملThe Effects of Technical and Organizational Activities on Redundancy Allocation Problem with Choice of Selecting Redundancy Strategies Using the memetic algorithm
Redundancy allocation problem is one of most important problems in reliability area. This problem involves with the suitable redundancy levels under certain strategies to maximizing system reliability under some constraints. Many changes have been made on this problem to draw the problem near to real situations. Selecting the redundancy strategy, using different system configuration are some of...
متن کاملMulti-Robot Adversarial Coverage
This work discusses the problem of adversarial coverage, in which one or more robots are required to visit every point of a given area, which contains threats that might stop the robots. The objective of the robots is to cover the target area as quickly as possible, while maximizing the percentage of covered area before they are stopped. This problem has many real-world applications, from perfo...
متن کامل